/**
 * 
 */
package array.passed;

/**
 * @author xyyi
 *
 */
public class RemoveDuplicatesfromSortedArray {

    /**
    Remove Duplicates from Sorted ArrayFeb 16 '121525 / 3153

    Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.

    Do not allocate extra space for another array, you must do this in place with constant memory.

    For example,
    Given input array A = [1,1,2],

    Your function should return length = 2, and A is now [1,2].
     */
    public int removeDuplicates(int[] A) {
        if (A == null || A.length == 0)
            return 0;

        int slow = 0, fast = 1;
        while (fast < A.length) {
            if (A[slow] != A[fast]) {
                A[++slow] = A[fast];
            }
            fast++;
        }
        return slow + 1;
    }

    /**
     * 
     */
    public RemoveDuplicatesfromSortedArray() {
        // TODO Auto-generated constructor stub
    }

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub

    }

}
